Decomposition of Separable Concave
نویسندگان
چکیده
This paper presents a decomposition scheme for a large class of greyscale structuring elements from mathematical morphology. In contrast with many existing decomposition schemes, our method is valid in the continuous domain. Conditions are given under which this continuous method can be properly discretized. The class of functions that can be decomposed with our method contains the class of quadratic functions, that are of major importance in, for instance, distance transforms and morphological scale space. In the continuous domain, the size of the structuring elements resulting from the decomposition, can be chosen arbitrarily small. For functions from the mentioned class, that can be separated along the standard image axes, a discrete decomposition in 3 × 3 elements can be guaranteed.
منابع مشابه
On the Dual Approach to Recursive Optimization
We bring together the theories of duality and dynamic programming. We show that the dual of an additively separable dynamic optimization problem can be recursively decomposed using summaries of past Lagrange multipliers as state variables. Analogous to the Bellman decomposition of the primal problem, we prove equality of values and solution sets for recursive and sequential dual problems. In no...
متن کاملNano- TiO2/Nd Deposited on -Fe2O3 as a Magnetically Separable Photocatalyst
TiO2/Magnetit and TiO2/Nd/Magnetit were prepared and used for photocatalytic decomposition of the methylorange as a pollutant. TiO2 and TiO2/Nd were prepared by sol gel method and were characterized using XRD, FT IR and TEM. The prepared catalysts were deposited on magnetite surface to have a catalyst with magnetite core. So the catalyst can be separated easily from the waste solution by a magn...
متن کاملFast weak-KAM integrators for separable Hamiltonian systems
We consider a numerical scheme for Hamilton–Jacobi equations based on a direct discretization of the Lax–Oleinik semi–group. We prove that this method is convergent with respect to the time and space stepsizes provided the solution is Lipschitz, and give an error estimate. Moreover, we prove that the numerical scheme is a geometric integrator satisfying a discrete weak–KAM theorem which allows ...
متن کاملA Branch and Bound Algorithm for Separable Concave Programming
In this paper, we propose a new branch and bound algorithm for the solution of large scale separable concave programming problems. The largest distance bisection (LDB) technique is proposed to divide rectangle into sub-rectangles when one problem is branched into two subproblems. It is proved that the LDB method is a normal rectangle subdivision(NRS). Numerical tests on problems with dimensions...
متن کاملLinear programs with an additional separable concave constraint
In this paper, we develop two algorithms for globally optimizing a special class of linear programs with an additional concave constraint. We assume that the concave constraint is defined by a separable concave function. Exploiting this special structure, we apply Falk-Soland’s branch-and-bound algorithm for concave minimization in both direct and indirect manners. In the direct application, we...
متن کامل